Termination Proof Script

Consider the TRS R consisting of the rewrite rules
1:    app(app(plus,0),y)  → y
2:    app(app(plus,app(s,x)),y)  → app(s,app(app(plus,x),y))
3:    app(app(times,0),y)  → 0
4:    app(app(times,app(s,x)),y)  → app(app(plus,app(app(times,x),y)),y)
5:    app(app(app(comp,f),g),x)  → app(f,app(g,x))
6:    app(twice,f)  → app(app(comp,f),f)
There are 11 dependency pairs:
7:    APP(app(plus,app(s,x)),y)  → APP(s,app(app(plus,x),y))
8:    APP(app(plus,app(s,x)),y)  → APP(app(plus,x),y)
9:    APP(app(plus,app(s,x)),y)  → APP(plus,x)
10:    APP(app(times,app(s,x)),y)  → APP(app(plus,app(app(times,x),y)),y)
11:    APP(app(times,app(s,x)),y)  → APP(plus,app(app(times,x),y))
12:    APP(app(times,app(s,x)),y)  → APP(app(times,x),y)
13:    APP(app(times,app(s,x)),y)  → APP(times,x)
14:    APP(app(app(comp,f),g),x)  → APP(f,app(g,x))
15:    APP(app(app(comp,f),g),x)  → APP(g,x)
16:    APP(twice,f)  → APP(app(comp,f),f)
17:    APP(twice,f)  → APP(comp,f)
The approximated dependency graph contains one SCC: {8,10,12,14-16}.
Tyrolean Termination Tool  (0.10 seconds)   ---  May 3, 2006